Weighted Logics for Traces
نویسنده
چکیده
We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series with those which are definable by restricted formulas from a weighted logics over traces. We use a translation technique from formulas over words to those over traces, and vice versa. This way, we show also the equivalence of aperiodic and first-order definable trace series.
منابع مشابه
Weighted Automata and Logics on Graphs
Weighted automata model quantitative features of the behavior of systems and have been investigated for various structures like words, trees, traces, pictures, and nested words. In this paper, we introduce a general model of weighted automata acting on graphs, which form a quantitative version of Thomas’ unweighted model of graph acceptors. We derive a Nivat theorem for weighted graph automata ...
متن کاملWeighted Distributed Systems and Their Logics
We provide a model of weighted distributed systems and give a logical characterization thereof. Distributed systems are represented as weighted asynchronous cellular automata. Running over directed acyclic graphs, Mazurkiewicz traces, or (lossy) message sequence charts, they allow for modeling several communication paradigms in a unifying framework, among them probabilistic sharedvariable and p...
متن کاملCompleteness for Logics on Finite Traces
Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. We propose that existing methods for proving deductive completeness for infinite-trace logics are effective on their finite counterparts. To adapt proofs for infinite-trace logics, we “inject” finiteness: that is, we alter the proof structure to ensure that models are finite. As evidence for...
متن کاملA unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties
Logical formalisms equivalent to weighted automata have been the topic of numerous research papers in the recent years. It started with the seminal result by Droste and Gastin on weighted logics over semirings for words. It has been extended in two dimensions by many authors. First, the weight domain has been extended to valuation monoids, valuation structures, etc., to capture more quantitativ...
متن کاملUniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
We study the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. We develop a general method to prove that the uniform satisfiability problem of local temporal logics is in PSPACE. We also demonstrate that this method applies to all known local temporal logics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006